0.03/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command    : duper %s
0.13/0.33	% Computer : n016.cluster.edu
0.13/0.33	% Model    : x86_64 x86_64
0.13/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory   : 8042.1875MB
0.13/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit   : 1440
0.13/0.33	% WCLimit    : 180
0.13/0.33	% DateTime   : Mon Jul  3 07:04:04 EDT 2023
0.13/0.33	% CPUTime    : 
3.91/4.11	SZS status Theorem for theBenchmark.p
3.91/4.11	SZS output start Proof for theBenchmark.p
3.91/4.11	Clause #0 (by assumption #[]): Eq
3.91/4.11	  (Not
3.91/4.11	    (And (And (∀ (Xy : a), Eq (cP (cJ Xy) Xy) cE) (∀ (Xx : a), Eq (cP cE Xx) Xx))
3.91/4.11	        (∀ (Xx Xy Xz : a), Eq (cP (cP Xx Xy) Xz) (cP Xx (cP Xy Xz))) →
3.91/4.11	      ∀ (X Y : a), Exists fun W => Eq (cP W X) Y))
3.91/4.11	  True
3.91/4.11	Clause #1 (by clausification #[0]): Eq
3.91/4.11	  (And (And (∀ (Xy : a), Eq (cP (cJ Xy) Xy) cE) (∀ (Xx : a), Eq (cP cE Xx) Xx))
3.91/4.11	      (∀ (Xx Xy Xz : a), Eq (cP (cP Xx Xy) Xz) (cP Xx (cP Xy Xz))) →
3.91/4.11	    ∀ (X Y : a), Exists fun W => Eq (cP W X) Y)
3.91/4.11	  False
3.91/4.11	Clause #2 (by clausification #[1]): Eq
3.91/4.11	  (And (And (∀ (Xy : a), Eq (cP (cJ Xy) Xy) cE) (∀ (Xx : a), Eq (cP cE Xx) Xx))
3.91/4.11	    (∀ (Xx Xy Xz : a), Eq (cP (cP Xx Xy) Xz) (cP Xx (cP Xy Xz))))
3.91/4.11	  True
3.91/4.11	Clause #3 (by clausification #[1]): Eq (∀ (X Y : a), Exists fun W => Eq (cP W X) Y) False
3.91/4.11	Clause #4 (by clausification #[2]): Eq (∀ (Xx Xy Xz : a), Eq (cP (cP Xx Xy) Xz) (cP Xx (cP Xy Xz))) True
3.91/4.11	Clause #5 (by clausification #[2]): Eq (And (∀ (Xy : a), Eq (cP (cJ Xy) Xy) cE) (∀ (Xx : a), Eq (cP cE Xx) Xx)) True
3.91/4.11	Clause #6 (by clausification #[4]): ∀ (a_1 : a), Eq (∀ (Xy Xz : a), Eq (cP (cP a_1 Xy) Xz) (cP a_1 (cP Xy Xz))) True
3.91/4.11	Clause #7 (by clausification #[6]): ∀ (a_1 a_2 : a), Eq (∀ (Xz : a), Eq (cP (cP a_1 a_2) Xz) (cP a_1 (cP a_2 Xz))) True
3.91/4.11	Clause #8 (by clausification #[7]): ∀ (a_1 a_2 a_3 : a), Eq (Eq (cP (cP a_1 a_2) a_3) (cP a_1 (cP a_2 a_3))) True
3.91/4.11	Clause #9 (by clausification #[8]): ∀ (a_1 a_2 a_3 : a), Eq (cP (cP a_1 a_2) a_3) (cP a_1 (cP a_2 a_3))
3.91/4.11	Clause #11 (by clausification #[3]): ∀ (a_1 : a), Eq (Not (∀ (Y : a), Exists fun W => Eq (cP W (skS.0 0 a_1)) Y)) True
3.91/4.11	Clause #12 (by clausification #[11]): ∀ (a_1 : a), Eq (∀ (Y : a), Exists fun W => Eq (cP W (skS.0 0 a_1)) Y) False
3.91/4.11	Clause #13 (by clausification #[12]): ∀ (a_1 a_2 : a), Eq (Not (Exists fun W => Eq (cP W (skS.0 0 a_1)) (skS.0 1 a_1 a_2))) True
3.91/4.11	Clause #14 (by clausification #[13]): ∀ (a_1 a_2 : a), Eq (Exists fun W => Eq (cP W (skS.0 0 a_1)) (skS.0 1 a_1 a_2)) False
3.91/4.11	Clause #15 (by clausification #[14]): ∀ (a_1 a_2 a_3 : a), Eq (Eq (cP a_1 (skS.0 0 a_2)) (skS.0 1 a_2 a_3)) False
3.91/4.11	Clause #16 (by clausification #[15]): ∀ (a_1 a_2 a_3 : a), Ne (cP a_1 (skS.0 0 a_2)) (skS.0 1 a_2 a_3)
3.91/4.11	Clause #17 (by superposition #[16, 9]): ∀ (a_1 a_2 a_3 a_4 : a), Ne (cP a_1 (cP a_2 (skS.0 0 a_3))) (skS.0 1 a_3 a_4)
3.91/4.11	Clause #27 (by clausification #[5]): Eq (∀ (Xx : a), Eq (cP cE Xx) Xx) True
3.91/4.11	Clause #28 (by clausification #[5]): Eq (∀ (Xy : a), Eq (cP (cJ Xy) Xy) cE) True
3.91/4.11	Clause #29 (by clausification #[27]): ∀ (a_1 : a), Eq (Eq (cP cE a_1) a_1) True
3.91/4.11	Clause #30 (by clausification #[29]): ∀ (a_1 : a), Eq (cP cE a_1) a_1
3.91/4.11	Clause #35 (by clausification #[28]): ∀ (a_1 : a), Eq (Eq (cP (cJ a_1) a_1) cE) True
3.91/4.11	Clause #36 (by clausification #[35]): ∀ (a_1 : a), Eq (cP (cJ a_1) a_1) cE
3.91/4.11	Clause #39 (by superposition #[36, 17]): ∀ (a_1 a_2 a_3 : a), Ne (cP a_1 cE) (skS.0 1 a_2 a_3)
3.91/4.11	Clause #40 (by superposition #[36, 9]): ∀ (a_1 a_2 : a), Eq (cP cE a_1) (cP (cJ a_2) (cP a_2 a_1))
3.91/4.11	Clause #42 (by forward demodulation #[40, 30]): ∀ (a_1 a_2 : a), Eq a_1 (cP (cJ a_2) (cP a_2 a_1))
3.91/4.11	Clause #51 (by superposition #[42, 36]): ∀ (a_1 : a), Eq a_1 (cP (cJ (cJ a_1)) cE)
3.91/4.11	Clause #61 (by superposition #[51, 42]): ∀ (a_1 : a), Eq cE (cP (cJ (cJ (cJ a_1))) a_1)
3.91/4.11	Clause #112 (by superposition #[61, 42]): ∀ (a_1 : a), Eq a_1 (cP (cJ (cJ (cJ (cJ a_1)))) cE)
3.91/4.11	Clause #115 (by superposition #[112, 51]): ∀ (a_1 : a), Eq (cJ (cJ a_1)) a_1
3.91/4.11	Clause #158 (by backward demodulation #[115, 51]): ∀ (a_1 : a), Eq a_1 (cP a_1 cE)
3.91/4.11	Clause #279 (by forward demodulation #[39, 158]): ∀ (a_1 a_2 a_3 : a), Ne a_1 (skS.0 1 a_2 a_3)
3.91/4.11	Clause #280 (by destructive equality resolution #[279]): False
3.91/4.11	SZS output end Proof for theBenchmark.p
3.91/4.11	EOF